A 1.5 + ε Approximation Algorithm for Weighted Hypergraph Embedding in a Cycle
نویسندگان
چکیده
The problem of Weighted Hypergraph Embedding in a Cycle (WHEC) is known to be NPcomplete even when each hyperedge is unweighted or each weighted hyperedge contains exactly two vertices. In this paper, we propose an approximation algorithm for the WHEC problem to provide a solution with approximation bound of 1.5(opt + wmax), where opt represents the optimal value of the problem and wmax denotes the largest weight of hyperedges. For any fixed ε > 0, we also present a polynomial-time approximation scheme to provide an embedding whose congestion is at most (1.5+ε) times the optimum. This improves previous results for the general WHEC problem.
منابع مشابه
On minimizing the maximum congestion for Weighted Hypergraph Embedding in a Cycle
The problem of Weighted Hypergraph Embedding in a Cycle (WHEC) is to embed the weighted hyperedges of a hypergraph as the paths in a cycle, such that the maximum congestion of any physical link in the cycle is minimized. A simpler version of this problem is the Weighted Graph Embedding in a Cycle (WGEC) that embeds the weighted edges of a normal graph as the paths in a cycle. The WHEC and WGEC ...
متن کاملApproximation Algorithms for Embedding a Weighted Directed Hypergraph on a Mixed Cycle∗
Given a weighted directed hypergraph H = (V,EH ;w), where w : EH → R+, we consider the problem of embedding all weighted directed hyperedges on a mixed cycle, which consists of undirected and directed links. The objective is to minimize the maximum congestion of any undirected or directed link in the mixed cycle. In this paper, we first formulate this new problem as an integer linear program, a...
متن کاملEfficient Algorithm for Embedding Hypergraphs in a Cycle
The problem of Minimum Congestion Hypergraph Embedding in a Cycle (MCHEC) is to embed the hyperedges of a hypergraph as paths in a cycle such that the maximum congestion (the maximum number of paths that use any single link in the cycle) is minimized. This problem has many applications, including minimizing communication congestions in computer networks and parallel computations. The MCHEC prob...
متن کاملRouting Algorithms for Ring Networks
In this thesis, we study routing problems on ring networks. The ring is a popular topology for communication networks and has attracted much research attention. A communication application on a ring network can be regarded as a set of connection requests, each of which is represented by a set of nodes to be connected in the ring network. To implement a communication application, we need to deve...
متن کاملA polynomial time approximation scheme for embedding a directed hypergraph on a weighted ring
Given a directed hypergraph H = (V ,EH ), we consider the problem of embedding all directed hyperedges on a weighted ring. The objective is to minimize the maximum congestion which is equal to the maximum product of the weight of a link and the number of times that the link is passed by the embedding. In this paper, we design a polynomial time approximation scheme for this problem.
متن کامل